Ordered sums of group elements
نویسندگان
چکیده
منابع مشابه
Representation of Finite Abelian Group Elements by Subsequence Sums
Let G ∼= Cn1 ⊕ · · · ⊕ Cnr be a finite and nontrivial abelian group with n1|n2| . . . |nr. A conjecture of Hamidoune says that if W = w1 · · ·wn is a sequence of integers, all but at most one relatively prime to |G|, and S is a sequence over G with |S| ≥ |W |+ |G| − 1 ≥ |G| + 1, the maximum multiplicity of S at most |W |, and σ(W ) ≡ 0 mod |G|, then there exists a nontrivial subgroup H such tha...
متن کاملSums of lexicographically ordered sets
We consider the problem of determining finite integer sets which are knapsack-solvable in linear time (that is, it is possible to determine in linear time, for any integer b, whether b can be expressed as a sum of distinct elements of that set) and where the largest element is as small as possible. We study the condition that the k-subsets (for fixed k) when lexicographically ordered have incre...
متن کاملOn Sums Over Partially Ordered Sets
We establish a general theorem for reducing sums of type ∑ y≥x g(y) where g is a mapping from a partially ordered set into an abelian group. Conclusions concern the Möbius function, the principle of inclusionexclusion, the Tutte polynomial and Crapo’s beta invariant.
متن کاملFixed Points of Products and Ordered Sums of Simply Ordered Sets
Let A and B be simply ordered sets and A XB the cartesian product ordered by first differences. Sufficiency conditions are given on the sets A and B for the existence of fixed points in the set AXB (Theorem 2). Sufficiency conditions are given on the sets A, B, and C for the incomparability of the order types1 \A XB\ and \A XC\ (| CXA\ and | CXB\) (Corollary 2 of Theorem 7). The content of Theo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1978
ISSN: 0097-3165
DOI: 10.1016/0097-3165(78)90051-1